New Constraint Qualifications for Mathematical Programs with Equilibrium Constraints via Variational Analysis
نویسندگان
چکیده
منابع مشابه
New Constraint Qualifications for Mathematical Programs with Equilibrium Constraints via Variational Analysis
In this paper, we study the mathematical program with equilibrium constraints (MPEC) formulated as a mathematical program with a parametric generalized equation involving the regular normal cone. Compared with the usual way of formulating MPEC through a KKT condition, this formulation has the advantage that it does not involve extra multipliers as new variables, and it usually requires weaker a...
متن کاملTwo New Weak Constraint Qualifications for Mathematical Programs with Equilibrium Constraints and Applications
We introduce two new weaker Constraint Qualifications (CQs) for mathematical programs with equilibrium (or complementarity) constraints, MPEC for short. One of them is a tailored version of the constant rank of subspace component (CRSC) and the other is a relaxed version of the MPECNo Nonzero Abnormal Multiplier Constraint Qualification (MPEC-NNAMCQ). Both incorporate the exact set of gradients...
متن کاملMathematical Programs with Equilibrium Constraints: A sequential optimality condition, new constraint qualifications and algorithmic consequences
Mathematical programs with equilibrium (or complementarity) constraints, MPECs for short, are a difficult class of constrained optimization problems. The feasible set has a very special structure and violates most of the standard constraint qualifications (CQs). Thus, the Karush-Kuhn-Tucker (KKT) conditions are not necessarily satisfied by minimizers and the convergence assumptions of many meth...
متن کاملComplementarity Constraint Qualifications and Simplified B-Stationarity Conditions for Mathematical Programs with Equilibrium Constraints
With the aid of some novel complementarity constraint quali cations, we derive some simpli ed primal-dual characterizations of a B-stationary point for a mathematical program with complementarity constraints (MPEC). The approach is based on a locally equivalent piecewise formulation of such a program near a feasible point. The simpli ed results, which rely heavily on a careful dissection and im...
متن کاملMathematical programs with vanishing constraints: optimality conditions and constraint qualifications
We consider a difficult class of optimization problems that we call a mathematical program with vanishing constraints. Problems of this kind arise in various applications including optimal topology design problems of mechanical structures. We show that some standard constraint qualifications like LICQ and MFCQ usually do not hold at a local minimum of our program, whereas the Abadie constraint ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Optimization
سال: 2017
ISSN: 1052-6234,1095-7189
DOI: 10.1137/16m1088752